Low-density parity-check codes on Markov channels
نویسنده
چکیده
Low-density parity-check codes are studied over Markov channels with time-varying gaussian or bit-flipping noise. The belief propagation decoding algorithm is extended to include channel estimation and the gains this extension produce are experimentally determined.
منابع مشابه
Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel
Low-density parity-check (LDPC) codes on symmetric memoryless channels have been analyzed using statistical physics by several authors. In this paper, statistical mechanical analysis of LDPC codes is performed for asymmetric memoryless channels and general Markov channels. It is shown that the saddle point equations of the replica symmetric solution for a Markov channel is equivalent to the den...
متن کاملAn Iterative Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channels
An iterative decoding algorithm of low density parity check(LDPC) codes for hidden Markov noise channels is presented. The hidden Markov noise channel is an additive noise channel whose noise statistics is modeled by a hidden Markov model(HMM). The proposed decoding algorithm consists of two parts: the conventional sum-product algorithm for the LDPC codes and a forward-backward likelihood estim...
متن کاملUpper Bounds on the Rate of Ramdomly Constructed LDPC Codes for a Class of Markov Channels
We consider a class of finite-state Markov channels, in which channel behaves as a Binary Symmetric Channel (BSC) in each state. We find upper bounds on the rate of LDPC codes for reliable communication over this class of Markov channels. However, the results hold only for the construction of LDPC codes in which a code is selected randomly from a given ensemble of codes.
متن کاملDecoding Ldpc Codes over Binary Channels with Additive Markov Noise
We study the design of a belief propagation decoder for lowdensity parity check (LDPC) codes over binary channels with additive M th-order Markov noise, specifically the queuebased channel (QBC) [1]. The decoder is an extension of the sum product algorithm (SPA) for the case of memoryless channels and is similar to the one developed for the GilbertElliot channel [2, 3, 4]. Simulation results of...
متن کاملImproved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation
We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density parity-check codes. For example, for rate 1/4 codes on 16,000 bits over a binary symmetric channel, previous low-density parity-check codes can correct up ...
متن کامل